SENSORY EVARUATION OF TRIANGLES
نویسندگان
چکیده
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملFrustrated triangles
A triple of vertices in a graph is a frustrated triangle if it induces an odd number of edges. We study the set Fn ⊂ [0, n 3 ] of possible number of frustrated triangles f (G) in a graph G on n vertices. We prove that about two thirds of the numbers in [0, n3/2] cannot appear in Fn, and we characterise the graphs G with f (G) ∈ [0, n3/2]. More precisely, our main result is that, for each n ≥...
متن کاملTractable Triangles
We study the computational complexity of binary valued constraint satisfaction problems (VCSP) given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables. We show that for several computational problems, including CSP, Max-CSP, finite-valued VCSP, and general-valued VCSP, the only non-trivial tractable classes are the well known max...
متن کاملPlatonic Triangles of Groups
Research supported by NSA and NSF. 1980 Mathematics Subject Classi cation (1985 Revision): 20E99.
متن کاملMagical Triangles
Simplicial complexes consist of a set of vertices together with designated subsets. They can be thought of as embedded in Rn with the induced metric and topology, where n is large enough that the points can all be geometrically independent. The sets of points spanned by these designated subsets then form triangles or their higher or lower dimensional analogues according to some restrictions. By...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KANSEI Engineering International
سال: 2001
ISSN: 1345-1928,1884-5231
DOI: 10.5057/kei.3.1